package com.dyz.leetcode._06_binarySearch;

public class _35_searchInsert {
    public int searchInsert(int[] nums, int target) {
        if(nums==null || nums.length==0){return 0;}
        int left =0;
        int right = nums.length-1;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (target <= nums[mid]) {
                if (mid == 0 || nums[mid - 1] < target) {return mid;}
                else {right = mid - 1;}
            } else {
                left = mid + 1;
            }
        }
        return right+1;
    }
}
